Energy-Efficient Flexible Flow Shop Scheduling With Due Date and Total Flow Time
نویسندگان
چکیده
One of the most significant optimization issues facing a manufacturing company is flexible flow shop scheduling problem (FFSS). However, FFSS with uncertainty and energy-related elements has received little investigation. Additionally, in order to reduce overall waiting times earliness/tardiness issues, topic shared due dates researched. Using transmission line loadings bus voltage magnitude variations, an unique severity function formulated this research. Optimize total energy consumption, agreement index, make span all at once. Many different meta-heuristics have been presented past find near-optimal answers acceptable amount computation time. To explore potential for saving floor management, multi-level technique integrates power models individual machines cutting parameters optimisation into energy-efficient proposed. it can be difficult time-consuming fine-tune algorithm-specific solving FFSP.
منابع مشابه
Batch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملEfficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
This paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the sequence since, as it is shown, its contribution to the total flow time is not negligible. Both procedures were combined with the insertion phase of NEH to improve the sequence. H...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Recent and Innovation Trends in Computing and Communication
سال: 2023
ISSN: ['2321-8169']
DOI: https://doi.org/10.17762/ijritcc.v11i2s.6145